Group-theoretic orbit decidability
نویسندگان
چکیده
منابع مشابه
Group-theoretic orbit decidability
A recent collection of papers in the last years have given a renovated interest to the notion of orbit decidability. This is a new quite general algorithmic notion, connecting with several classical results, and closely related to the study of the conjugacy problem for extensions of groups. In the present survey we explain several of the classical results closely related to this concept, and we...
متن کاملGame Theoretic Decidability and Undecidability∗
We study the possibility of prediction/decision making in a finite 2—person game with pure strategies, following the Nash(-Johansen) noncooperative solution theory. We adopt the epistemic logic KD as the base logic to capture individual decision making from the viewpoint of logical inference. Since some infinite regresses naturally arise in this theory, we use a fixed-point extension EIR of KD ...
متن کاملA Group Theoretic Approach
Keywords| Filter banks, bi-orthogonal, linear phase, McClellan transformations, multirate systems. EDICS| Filter Bank Theory 2.4.2. Abstract| In this paper we provide a new method for analyzing multidimensional lter banks. This method enables us to solve various open problems in multidimensional l-ter bank characterization and design. The essential element in this new approach is the redeenitio...
متن کاملDeenability of Group Theoretic Notions
We consider logical deenability of the group-theoretic notions of simplicity, nilpotency and solvability on the class of nite groups. On one hand, we show that these notions are deenable by sentences of deterministic transitive closure logic DTC. These results are based on known group-theoretic results. On the other hand, we prove that simplicity, nilpotency and the normal closure of a subset o...
متن کاملDecision-Theoretic Group Elevator Scheduling
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are represented by a discrete-state Markov chain embedded in the continuous phase-space diagram of a moving elevator car. The chain is evaluated efficiently using dynamic programming to compute measures of future system perfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups Complexity Cryptology
سال: 2014
ISSN: 1867-1144,1869-6104
DOI: 10.1515/gcc-2014-0012